Characterizing Relevant Belief Revision Operators
نویسندگان
چکیده
This paper introduces a framework for relevant belief revision. We represent agent’s beliefs in prime implicants and express agent’s preference on beliefs as a pre-order over terms. We define a belief revision operator via minimising the change of the prime implicants of the existing beliefs and the incoming information with respect to agent’s preferences. We show that such a belief revision operator satisfies Katsuno and Mendelzon’s postulates for belief revision as well as Parikh’s postulate for relevant revision. This paper demonstrates a natural way to identify relevance of beliefs and an implementation of Parikh’s relevant belief revision.
منابع مشابه
Syntax-Preserving Belief Change Operators for Logic Programs
Recent methods have adapted the well-established AGM and belief base frameworks for belief change to cover belief revision in logic programs. In this study here, we present two new sets of belief change operators for logic programs. They focus on preserving the explicit relationships expressed in the rules of a program, a feature that is missing in purely semantic approaches that consider progr...
متن کاملPartial Meet Revision and Contraction in Logic Programs
The recent years have seen several proposals aimed at placing the revision of logic programs within the belief change frameworks established for classical logic. A crucial challenge of this task lies in the nonmonotonicity of standard logic programming semantics. Existing approaches have thus used the monotonic characterisation via SE-models to develop semantic revision operators, which however...
متن کاملA general approach to belief change in answer set programming
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Unlike previous approaches to belief change in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing our results, we build upon the model theory of logic programs furnished by SE models. Since SE models provide ...
متن کاملA A Model-theoretic Approach to Belief Change in Answer Set Programming
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical int...
متن کاملDynamical revision operators with memory
We have proposed in previous work [11, 12] a construction that allows to define operators for iterated revision from classical AGM revision operators. We called those operators revision operators with memory and show that the operators obtained have nice logical properties. But those operators can be considered as too conservative, since the revision policy of the agent, encoded as a faithful a...
متن کامل